NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
451	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
452	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
453	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
454	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
455	PDF Document Add to Reading List Source URL: www.psi.toronto.edu Language: English - Date: 2014-04-30 16:04:07 NP-complete problems Probability theory Operations research Belief propagation Coding theory Fourier transform Combinatory logic Dominating set Linear programming Theoretical computer science Mathematics Applied mathematics
456	Proceedings of the 2005 International Conference on Simulation and Modeling V. Kachitvichyanukul, U. Purintrapiban, P. Utayopas, eds. HETEROGENOUS ANT ALGORITHM FOR JOB SHOP SCHEDULING Apinanthana Udomsakdigool and Vorat Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 21:51:44 Theoretical computer science Mathematical optimization NP-complete problems Ant colony optimization algorithms Stochastic optimization Collective intelligence Travelling salesman problem Job shop scheduling Artificial Ants Applied mathematics Operations research Mathematics
457	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
458	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
459	Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:11:06 Formal methods Metalogic Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Conjunctive normal form Mathematical proof Mathematics Theoretical computer science Logic
460	Software Engineering and Automated Deduction Willem Visser Nikolaj Bjørner Natarajan Shankar Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:12 Formal methods Automated theorem proving Logic in computer science NP-complete problems Model checking Satisfiability Modulo Theories Boolean satisfiability problem KeY First-order logic Theoretical computer science Logic Mathematical logic

UPDATE